In Proceedings of ICDE ’ 96 : The 1996

نویسنده

  • Azer Bestavros
چکیده

We present two server initiated protocols to improve the performance of distributed information systems e g WWW Our rst protocol is a hierarchical data dissemination mechanism that allows information to propagate from its producers to servers that are closer to its consumers This dissemination reduces network tra c and balances load amongst servers by exploiting geographic and temporal locality of reference properties exhibited in client access patterns Our second protocol relies on speculative service whereby a request for a document is serviced by sending in addition to the doc ument requested a number of other documents that the server speculates will be requested in the near future This speculation reduces service time by exploiting the spatial locality of reference property We present results of trace driven simulations that quantify the attainable performance gains for both protocols

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

In Proceedings of ICDE ’ 96 : The 1996 International

We present two server-initiated protocols to improve the performance of distributed information systems (e.g. WWW). Our rst protocol is a hierarchical data dissemination mechanism that allows information to propagate from its producers to servers that are closer to its consumers. This dissemination reduces network traac and balances load amongst servers by exploiting geographic and temporal loc...

متن کامل

Optimization of the Prismatic Core Sandwich Panel under Buckling Load and Yield Stress Constraints using an Improved Constrained Differential Evolution Algorithm

In this study, weight optimization of the prismatic core sandwich panel under transverse and longitudinal loadings has been independently investigated. To solve the optimization problems corresponding to the mentioned loadings, a new Improved Constrained Differential Evolution (ICDE) algorithm based on the multi-objective constraint handling method is implemented. The constraints of the problem...

متن کامل

Similarity Indexing with the SS-tree

Eficient indezing of high dimensional feature vectors is important to allow visual information systems and a number other applications to scale up to large databases. In this paper, we define this problem as “similarity indexing” and describe the fundamental types of “similarity queries” that we believe should be

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996